Trial-Based Heuristic Tree-search for Distributed Multi-Agent Planning
نویسندگان
چکیده
We present a novel search scheme for privacypreserving multi-agent planning. Inspired by UCT search, the scheme is based on growing an asynchronous search tree by running repeated trials through the tree. We describe key differences to classical multiagent forward search, discuss theoretical properties of the presented approach, and evaluate it based on benchmarks from the CoDMAP competition.
منابع مشابه
Distributed Heuristic Forward Search for Multi-agent Planning
This paper deals with the problem of classical planning for multiple cooperative agents who have private information about their local state and capabilities they do not want to reveal. Two main approaches have recently been proposed to solve this type of problem – one is based on reduction to distributed constraint satisfaction, and the other on partial-order planning techniques. In classical ...
متن کاملStochastic Planning in Large Search Spaces
Multi-agent planning approaches are employed for many problems including task allocation, surveillance and video games. In the first part of my thesis, we study two multi-robot planning problems, i.e. patrolling and task allocation. For the patrolling problem, we present a novel stochastic search technique, Monte Carlo Tree Search with Useful Cycles, that can generate optimal cyclic patrol poli...
متن کاملPotential Heuristics for Multi-Agent Planning
Distributed heuristic search is a well established technique for multi-agent planning. It has been shown that distributed heuristics may crucially improve the search guidance, but are costly in terms of communication and computation time. One solution is to compute a heuristic additively, in the sense that each agent can compute its part of the heuristic independently and obtain a complete heur...
متن کاملHPP: A Heuristic Progressive Planner
In the last decade three main ideas have revolutionized the Artificial Intelligence (AI) planning methods: the plan graph search structure, planning as satisfiability and the search guided by a heuristic function calculated from a relaxed plan. In this paper we present a new planner, named HPP (Heuristic Progressive Planner), that has been implemented using several ideas extracted from other he...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کامل